Gather-and-broadcast frequency control in power systems

We propose a novel frequency control approach in between centralized and distributed architectures, that is a continuous-time feedback control version of the dual decomposition optimization method. Specifically, a convex combination of the frequency measurements is centrally aggregated, followed by an integral control and a broadcast signal, which is then optimally allocated at local generation units. We show that our gather-and-broadcast control architecture comprises many previously proposed strategies as special cases. We prove local asymptotic stability of the closed-loop equilibria of the considered power system model, which is a nonlinear differential-algebraic system that includes traditional generators, frequency-responsive devices, as well as passive loads, where the sources are already equipped with primary droop control. Our feedback control is designed such that the closed-loop equilibria of the power system solve the optimal economic dispatch problem

A Douglas-Rachford splitting for semi-decentralized equilibrium seeking in generalized aggregative games

We address the generalized aggregative equilibrium seeking problem for noncooperative agents playing average aggregative games with affine coupling constraints. First, we use operator theory to characterize the generalized aggregative equilibria of the game as the zeros of a monotone set-valued operator. Then, we massage the Douglas-Rachford splitting to solve the monotone inclusion problem and derive a single layer, semi-decentralized algorithm whose global convergence is guaranteed under mild assumptions. The potential of the proposed Douglas-Rachford algorithm is shown on a simplified resource allocation game, where we observe faster convergence with respect to forward-backward algorithms.Comment: arXiv admin note: text overlap with arXiv:1803.1044

Composite control Lyapunov functions for robust stabilization of constrained uncertain dynamical systems

This work presents innovative scientific results on the robust stabilization of constrained uncertain dynamical systems via Lyapunov-based state feedback control. Given two control Lyapunov functions, a novel class of smooth composite control Lyapunov functions is presented. This class, which is based on the R-functions theory, is universal for the stabilizability of linear differential inclusions and has the following property. Once a desired controlled invariant set is fixed, the shape of the inner level sets can be made arbitrary close to any given ones, in a smooth and non-homothetic way. This procedure is an example of ``merging'' two control Lyapunov functions. In general, a merging function consists in a control Lyapunov function whose gradient is a continuous combination of the gradients of the two parents control Lyapunov functions. The problem of merging two control Lyapunov functions, for instance a global control Lyapunov function with a large controlled domain of attraction and a local one with a guaranteed local performance, is considered important for several control applications. The main reason is that when simultaneously concerning constraints, robustness and optimality, a single Lyapunov function is usually suitable for just one of these goals, but ineffective for the others. For nonlinear control-affine systems, both equations and inclusions, some equivalence properties are shown between the control-sharing property, namely the existence of a single control law which makes simultaneously negative the Lyapunov derivatives of the two given control Lyapunov functions, and the existence of merging control Lyapunov functions. Even for linear systems, the control-sharing property does not always hold, with the remarkable exception of planar systems. For the class of linear differential inclusions, linear programs and linear matrix inequalities conditions are given for the the control-sharing property to hold. The proposed Lyapunov-based control laws are illustrated and simulated on benchmark case studies, with positive numerical results

Towards time-varying proximal dynamics in Multi-Agent Network Games

Distributed decision making in multi-agent networks has recently attracted significant research attention thanks to its wide applicability, e.g. in the management and optimization of computer networks, power systems, robotic teams, sensor networks and consumer markets. Distributed decision-making problems can be modeled as inter-dependent optimization problems, i.e., multi-agent game-equilibrium seeking problems, where noncooperative agents seek an equilibrium by communicating over a network. To achieve a network equilibrium, the agents may decide to update their decision variables via proximal dynamics, driven by the decision variables of the neighboring agents. In this paper, we provide an operator-theoretic characterization of convergence with a time-invariant communication network. For the time-varying case, we consider adjacency matrices that may switch subject to a dwell time. We illustrate our investigations using a distributed robotic exploration example.Comment: 6 pages, 3 figure

Decentralized Convergence to Nash Equilibria in Constrained Deterministic Mean Field Control

This paper considers decentralized control and optimization methodologies for large populations of systems, consisting of several agents with different individual behaviors, constraints and interests, and affected by the aggregate behavior of the overall population. For such large-scale systems, the theory of aggregative and mean field games has been established and successfully applied in various scientific disciplines. While the existing literature addresses the case of unconstrained agents, we formulate deterministic mean field control problems in the presence of heterogeneous convex constraints for the individual agents, for instance arising from agents with linear dynamics subject to convex state and control constraints. We propose several model-free feedback iterations to compute in a decentralized fashion a mean field Nash equilibrium in the limit of infinite population size. We apply our methods to the constrained linear quadratic deterministic mean field control problem and to the constrained mean field charging control problem for large populations of plug-in electric vehicles.Comment: IEEE Trans. on Automatic Control (cond. accepted